Lec . 2 : Approximation Algorithms for NP - hard Problems ( Part II )
نویسنده
چکیده
We will continue the survey of approximation algorithms in this lecture. First, we will discuss a (1+ε)-approximation algorithm for Knapsack in time poly(n, 1/ε). We will then see applications of some heavy hammers such as linear programming (LP) and semi-definite programming (SDP) towards approximation algorithms. More specifically, we will see LPbased approximation for MAXSAT and MAXCUT. In the following lecture, we will see a SDP-based algorithm for MAXCUT. The references for this lecture include Lecture 1 of the DIMACS tutorial on Limits of approximation [HC09], Lectures 2, 3 and 4 of Sudan’s course on inapproximability at MIT [Sud99], and Section 8 from Vazirani’s book on Approximation Algorithms [Vaz04].
منابع مشابه
Lec . 1 : Approximation Algorithms for NP - hard problems
In this course, we will be studying, as the title suggests, the approximability and inapproximability (limits of approximability) of different combinatorial optimization problems. All the problems we will be looking at will be ones that lack efficient algorithms and in particular will be NP-hard problems. The last two-three decades has seen remarkable progress in approximation algorithms for se...
متن کاملThe Design of Approximation Algorithms
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows ...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملResult Veriication Algorithms for Optimization Problems
In this article we discuss the design of result veriication algorithms for optimization problems. In particular, we design time-optimal result veriication algorithms which verify the solution of all-pairs shortest paths, maximum-ow in a network, and matching problems. We prove that polynomial-time veriication algorithms for NP-complete problems do not exist exist, unless P = NP. Result veriicat...
متن کامل